Semantics of an Anytime Family of Reasoners

Preliminary Empirical Results on Anytime Propositional Reasoning (Abstract)

An anytime family of propositional reasoners is a sequence `0;`1; : : : of inference relations such that each `k is sound, tractable, and makes more inferences than `k 1, and each theory has a complete reasoner in the family. Anytime families are useful for resource-bounded reasoning in knowledge representation systems. We describe implementations of an anytime family f`kg of clausal propositio...

Preliminary Empirical Results on Anytime Propositional Reasoning (Abstract)

An anytime family of propositional reasoners is a sequence I-o, I-i,... of inference relations such that each I-k is sound, tractable, and makes more inferences than I-k-i, and each theory has a complete reasoner in the family. Anytime families are useful for resource-bounded reasoning in knowledge representation systems. We describe implementations of an anytime family {I-t,} of clausal propos...

Anytime Families of Tractable Propositional Reasoners

A Proof Theory for Tractable Approximations of Propositional Reasoning

This paper proposes an uniform framework for the proof theory of tractable approximations of propositional reasoning. The key idea is the introduction of approximate proofs. This makes possible the development of an approximating sequent calculus for propositional deduction where proofs can be sound, complete or multi-directional approximations of classical logic. We show how this calculus subs...

A Reasoning Broker Framework for OWL

Semantic applications that utilise OWL ontologies can benefit from a broad range of OWL reasoning systems, which allow for the inference of implicit knowledge from explicitly given facts and axioms. Different OWL reasoners, however, specialise in different reasoning problems or kinds of ontologies, and hence perform differently in certain reasoning scenarios. This paper presents a reasoning bro...